The literature on affective determinants of physical activity is growing rapidly. The present paper aims to provide greater clarity regarding the definition and distinctions among the various affect-related constructs that have been examined in relation to PA. Affective constructs are organized according to the Affect and Health Behavior Framework, including: affective response to PA; incidental affect; affect processing; and affectively charged motivational states. After defining each category of affective construct, we provide examples of relevant research showing how each construct may (...) relate to PA behavior. We conclude each section with a discussion of future directions for research. (shrink)

This book applies Augustine's thought to current questions of teaching and learning. The essays are written in an accessible style and is not intended just for experts on Augustine or church history.

Generalizedn-gons are certain geometric structures (incidence geometries) that generalize the concept of projective planes (the nontrivial generalized 3-gons are exactly the projective planes).In a simplified world, every generalizedn-gon of finite Morley rank would be an algebraic one, i.e., one of the three families described in [9] for example. To our horror, John Baldwin [2], using methods discovered by Hrushovski [7], constructed ℵ1-categorical projective planes which are not algebraic. The projective planes that Baldwin constructed fail to be algebraic in (...) a dramatic way.Indeed, every algebraic projective plane over an algebraically closed field is Desarguesian [12]. In particular, an algebraically closed field (isomorphic to the base field) can be interpreted in every one of them. However, in the projective planes that Baldwin constructed, one cannot even interpret an infinite group.In this article we show that the same phenomenon occurs for the generalizedn-gons ifn≥ 3 is an odd integer. For each suchnwe constructmany nonisomorphic generalizedn-gons of finite Morley rank that do not interpret an infinite group. As one may expect, our method is inspired by Hrushovski and Baldwin, and we follow Baldwin's line of approach. Quite often our proofs are a verification of the fact that the proofs of Baldwin [2] forn= 3 carry over to an arbitrary positive odd integern(which is sometimes far from being obvious). As in [2], we begin by defining a certain collection of finite graphsK* and a binary relation ≤ on these graphs. We show that (K*, ≤) satisfies the amalgamation property. (shrink)